def solve():
l = list(map(int,input().split()))
n = int(input())
sizes = ["S","M","L","XL","XXL"]
def get_tshirt(num):
if num < 0 or num >= 5 or l[num] == 0:
return False
else:
print(sizes[num])
l[num] = l[num] - 1
return True
for _ in range(n):
sz = input().strip()
i = sizes.index(sz)
if l[i] > 0: print(sz)
l[i] -= 1
else: for j in range(1, 5):
if get_tshirt(i+j) or get_tshirt(i-j):
break
solve()#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
string s[5]={"S","M","L","XL","XXL"};
int num[5];
for(int i=0; i<5; i++){
cin>>num[i];
}
int n,j;
cin>>n;
string t;
for(int i=0; i<n; i++){
cin>>t;
for(j=0; j<5; j++){
if(s[j]==t) break;
}
for(int k=0; k<5; k++){
if(j+k<5&&num[j+k]){
cout<<s[j+k]<<endl;
num[j+k]--;
break;
}
else if(j-k>=0&&num[j-k]){
cout<<s[j-k]<<endl;
num[j-k]--;
break;
}
}
}
}
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |
1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |